Parallel ILP for distributed-memory architectures
نویسندگان
چکیده
منابع مشابه
Parallel Implicit Integration for Cloth Animations on Distributed Memory Architectures
We present a parallel cloth simulation engine designed for distributed memory parallel architectures, in particular clusters built of commodity components. We focus on efficient parallel processing of irregularly structured and real-world sized problems typically occurring in the simulation of garments. We report on performance measurements showing a high degree of parallel efficiency and scala...
متن کاملA Portable 3D FFT Package for Distributed-Memory Parallel Architectures
1 I n t r o d u c t i o n Multidimensional FF’I’s are used frequently in engineerillg and scientific calculations, especially in image processing. Parallel implementations of FFT generally follow two approaches. One is the binary-exchange approach[l ,2], where data exchanges take place in all pairs of processors with processor numbers differing by one bit. Another one is the transpose approach[...
متن کاملParallel Performance Prediction for Multigrid Codes on Distributed Memory Architectures
We propose a model for describing the parallel performance of multigrid software on distributed memory architectures. The goal of the model is to allow reliable predictions to be made as to the execution time of a given code on a large number of processors, of a given parallel system, by only benchmarking the code on small numbers of processors. This has potential applications for the schedulin...
متن کاملCellFlow: A Parallel Rendering Scheme for Distributed Memory Architectures
CellFlow is an animation system that exploits frame coherency to implement a lookahead scheme of object dataflow. The implementation of this scheme uses the communication features of modern scalable multicomputers to achieve good speedup by means of latency hiding. We demonstrate the performance of our approach in the field of volume rendering by implementing incremental rotation of the volumet...
متن کاملSpatial Partitioning for Parallel Hierarchical Radiosity on Distributed Memory Architectures
This paper presents an efficient, highly scalable implementation of the Hierarchical Radiosity Algorithm. We present a clever mapping of Hierarchical Radiosity to high-dimensional spaces that manifests a locality property, which can greatly reduce communication on parallel distributed memory architectures. We use a very simple dynamic spatial partitioning method to keep the mapping balanced. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2008
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-008-5094-2